Examples of L2-complete and boundedly-complete distributions
نویسندگان
چکیده
منابع مشابه
Some incomplete and boundedly complete families of discrete distributions
We present a general result giving us families of incomplete and boundedly complete families of discrete distributions. For such families, the classes of unbiased estimators of zero with finite variance and of parametric functions which will have uniformly minimum variance unbiased estimators with finite variance are explicitly characterized. The general result allows us to construct a large nu...
متن کاملBOUNDEDLY a-COMPLETE BOOLEAN ALGEBRAS AND APPLICATIONS TO OPERATOR THEORY
A systematic study is made of spectral measures in locally convex spaces which are countably additive for the topology of uniform convergence on bounded sets, briefly, the bounded convergence topology. Even though this topology is not compatible for the duality with respect to the pointwise convergence topology it turns out, somewhat surprisingly, that the corresponding L'-spaces for the spectr...
متن کاملL2-cohomology and Complete Hamiltonian Manifolds
A classical theorem of Frankel for compact Kähler manifolds states that a Kähler S-action is Hamiltonian if and only if it has fixed points. We prove a metatheorem which says that when Hodge theory holds on non-compact manifolds, then Frankel’s theorem still holds. Finally, we present several concrete situations in which the assumptions of the metatheorem hold. 1. The Classical Frankel Theorem ...
متن کامل#p-complete Conditional Distributions
We study conditional probability from the perspective of complexity theory of functions and operators in analysis, building on work by Ko (1983), Friedman (1984), and Kawamura and Cook (2010). For some random variable X in {0, 1}N whose distribution is continuous and polynomial-time computable, and some polynomial-time computable function f : {0, 1}N → [0, 1] for which the random variable f(X) ...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Econometrics
سال: 2017
ISSN: 0304-4076
DOI: 10.1016/j.jeconom.2017.05.011